1945B - Fireworks - CodeForces Solution

from math import *

def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)
def lcm(a, b):
    return a // gcd(a, b) * b
def query(a, b):
    return a // b
t = int(input())

for i in range(t):
    a, b, k = list(map(int, input().split()))
    mn = lcm(a, b)
    res = query(mn + k, a) - query(mn - a, a)
    res += query(mn + k, b) - query(mn - b, b)
    print(res)